On the Grassmann condition number
نویسندگان
چکیده
We give new insight into the Grassmann condition of the conic feasibility problem find x ∈ L ∩K \ {0}. (1) Here K ⊆ V is a regular convex cone and L ⊆ V is a linear subspace of the finite dimensional Euclidean vector space V . The Grassmann condition of (1) is the reciprocal of the distance from L to the set of ill-posed instances in the Grassmann manifold where L lives. We consider a very general distance in the Grassmann manifold defined by two possibly different norms in V . We establish the equivalence between the Grassmann distance to ill-posedness of (1) and a natural measure of the least violated trial solution to the alternative to (1). We also show a tight relationship between the Grassmann and Renegar’s condition measures, and between the Grassmann measure and a symmetry measure of (1). Our approach can be readily specialized to a canonical norm in V induced by K, a prime example being the one-norm for the nonnegative orthant. For this special case we show that the Grassmann distance ill-posedness of (1) is equivalent to a measure of the most interior solution to (1). ∗Tepper School of Business, Carnegie Mellon University, USA, [email protected] †School of Science, RMIT University, AUSTRALIA, [email protected]
منابع مشابه
A Coordinate-Free Condition Number for Convex Programming
We introduce and analyze a natural geometric version of Renegar’s condition number R, which we call Grassmann condition number, for the homogeneous convex feasibility problem associated with a regular cone C ⊆ R. Let Grn,m denote the Grassmann manifold of m-dimensional linear subspaces of R with the Riemannian distance metric dg. The set of ill-posed instances Σm ⊂ Grn,m consists of the linear ...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملProbabilistic Analysis of the Grassmann Condition Number
We perform an average analysis of the Grassmann condition number C (A) for the homogeneous convex feasibility problem ∃x ∈ C \ 0 : Ax = 0, where C ⊂ R may be any regular cone. This in particular includes the cases of linear programming, second-order programming, and semidefinite programming. We thus give the first average analysis of convex programming, which is not restricted to linear program...
متن کاملPseudorandom Sets in Grassmann Graph have Near-Perfect Expansion
We prove that pseudorandom sets in Grassmann graph have near-perfect expansion as hypothesized in [4]. This completes the proof of the 2-to-2 Games Conjecture (albeit with imperfect completeness) as proposed in [15, 3], along with a contribution from [2, 14]. The Grassmann graph Grglobal contains induced subgraphs Grlocal that are themselves isomorphic to Grassmann graphs of lower orders. A set...
متن کاملA Grassmann integral equation
The present study introduces and investigates a new type of equation which is called Grassmann integral equation in analogy to integral equations studied in real analysis. A Grassmann integral equation is an equation which involves Grassmann (Berezin) integrations and which is to be obeyed by an unknown function over a (finite-dimensional) Grassmann algebra Gm (i.e., a sought after element of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016